Recombination Operators for Evolutionary Graph Drawing
نویسندگان
چکیده
This paper illustrates an evolutionary algorithm for drawing graphs according to a number of esthetic criteria. Tests are carried out on three graphs of increasing diiculty and the performance of four diier-ent recombination operators are compared. The results are then brieey discussed and compared to those obtained with a tabu search.
منابع مشابه
Drawing Graphs with Evolutionary Algorithms
This paper illustrates an evolutionary algorithm for drawing graphs according to a number of esthetic criteria. Tests are carried out on three graphs of increasing diiculty and a comparison is made on the performance of three diierent recombination operators. The results are then brieey discussed.
متن کاملToward Evolutionary Innovation Theory
Abstract: Innovations, commercialized by new or old established firms, located at the core of industrial renewal process. The innovation concept has suffered transformations, along with the evolution of the models that try to explain and understand the innovation process. The innovative process corresponds to all activities that generate technological changes and the dynamic interaction between...
متن کاملTOWARD EVOLUTIONARY INNOVATION THEORY
Innovations, commercialized by new or old established firms, located at the core of industrial renewal process. The innovation concept has suffered transformations, along with the evolution of the models that try to explain and understand the innovation process. The innovative process corresponds to all activities that generate technological changes and the dynamic interaction between them, not...
متن کاملA Comparison Of Memetic Recombination Operators For The Traveling Salesman Problem
Several memetic algorithms (MAs) – evolutionary algorithms incorporating local search – have been proposed for the traveling salesman problem (TSP). Much effort has been spent to develop recombination operators for MAs which aim to exploit problem characteristics to achieve a highly effective search. In this paper, several recombination operators for the TSP are compared. For the purpose of ide...
متن کاملMeta-Evolution in Graph GP
In this contribution we investigate the evolution of operators for Genetic Programming by means of Genetic Programming. Metaevolution of recombination operators in graph-based GP is applied and compared to other methods for the variation of recombination operators in graph-based GP. We demonstrate that a straightforward application of recombination operators onto themselves does not work well. ...
متن کامل